منابع مشابه
Constructing Speciication Morphisms
Speciication morphisms underlie the reenement of algebraic speciications and provide the logical foundations for algorithm and data structure design. We present four techniques for formally, even mechanically, constructing speciication morphisms. The rst two techniques, verifying a manually constructed signature morphism and composition of speciication morphisms are well-known. The remaining tw...
متن کاملOn the Complexity of Specification Morphisms
The existence and the construction of a specification morphism between two algebraic specifications is a crucial step in modular system design and in the reusability of software. The problem of determining the existence of a signature morphism between two algebraic signatures is analyzed and proved to be NP-complete by reducing the well known 3SAT problem. As a consequence, the problem of findi...
متن کاملEnhancing the established strategy for constructing a Z specification
The Established Strategy for drawing up a Z specification document focuses on a more abstract activity of specification, namely, how to combine schemas but is largely silent about how to construct a schema. Schema construction may benefit from the application of certain heuristics for establishing its content. While formal specification can be seen as a subsection of software engineering and de...
متن کاملOn morphisms of crossed polymodules
In this paper, we prove that the category of crossed polymodules (i.e. crossed modules of polygroups) and their morphisms is finitely complete. We, therefore, generalize the group theoretical case of this completeness property of crossed modules.
متن کاملSorting Morphisms
Sorting algorithms can be classiied in many diierent ways. The way presented here is by expressing the algorithms as functional programs and to classify them by means of their recursion patterns. These patterns on their turn can be classiied as the natural recursion patterns that destruct or construct a given data-type, the so called cata-and anamorphisms respectively. We show that the selectio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1993
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(06)80006-4